Département d ’ Informatique et de recherche opérationnelle ( DIRO ) Rapport technique 1273 Février 2006 Geo - consistency for Multi - Camera Stereo by Marc - Antoine Drouin

نویسندگان

  • Marc-Antoine Drouin
  • Martin Trudeau
  • Sébastien Roy
چکیده

This paper introduces the concept of geo-consistency to overcome the occlusion problems associated with wide-baseline multiple-camera stereo. By expressing more formally the geometric relationship between occlusion and visibility, it provides a new tool to understand and compare the behavior of stereo algorithms. In this context, we present a new visibility mask handling that can render most regular stereo algorithms ”occlusion aware”. Rather than explicitly modeling occlusions in the matching cost function, it detects occlusions in the depth map obtained from regular efcient stereo matching algorithms. The algorithm gradually modies the matching cost function according to the history of inconsistencies in the depth map, until convergence. The nal depth map is guaranteed to preserve the coherence between camera visibility and geometry. We also provide a fast specialized stereo algorithm, based on Iterative Dynamic Programming, that model visibility very efciently. It is based on partial geo-consistency, in which some of the visibility information is always known exactly. Geo-consistency makes it easier to express the ordering constraint. This is helpful for the detection of the parts of a scene not fullling it. These zones are the most subject to error and should be handled separately. We observed that our fast IDP algorithm is especially wellsuited for high discontinuity areas. For experiments, we applied our general occlusion algorithm to two common graph-theoretic stereo algorithms. The validity of our framework is demonstrated using real imagery taken with various baselines, as it is known that occlusion increases with it.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Simulation of bipartite qudit correlations

Julien Degorre, 2 Sophie Laplante, and Jérémie Roland 1 Laboratoire de Recherche en Informatique, UMR 8263, Université Paris-Sud, 91405 Orsay, France Laboratoire d’Informatique Théorique et Quantique, Département d’Informatique et de Recherche Opérationnelle, Université de Montréal, Canada Quantum Information and Communication, Ecole Polytechnique, CP 165/59, Université Libre de Bruxelles, 1050...

متن کامل

SSJ: Stochastic Simulation in Java Overview

SSJ is a Java library for stochastic simulation, developed in the Département d'Informa-tique et de Recherche Opérationnelle (DIRO), at the Université de Montréal. It provides facilities for generating uniform and nonuniform random variates, computing different measures related to probability distributions, performing goodness-of-fit tests, applying quasi-Monte Carlo methods, collecting statist...

متن کامل

Grammar-Based Column Generation for Personalized Multi-Activity Shift Scheduling

Multi-Activity Shift Scheduling Marie-Claude Côté Département de mathématiques appliquées et génie industriel, École Polytechnique de Montréal, Montréal, Canada Interuniversity Research Center on Enterprise Networks, Logistics and Transportation, Montréal, Canada {[email protected]} Bernard Gendron Département d’informatique et de recherche opérationnelle, Université de Montréal, Montréal, Cana...

متن کامل

Efficient Jump Ahead for F2-linear Random Number Generators

Hiroshi Haramoto, Makoto Matsumoto Department of Mathematics, Hiroshima University, Kagamiyama 1-3-1 Higashi-Hiroshima, Hiroshima 739-8526, Japan {[email protected] and [email protected]} Takuji Nishimura Department of Mathematical Sciences, Yamagata University, Yamagata 990-8586, Japan {[email protected]} François Panneton and Pierre L’Ecuyer Département ...

متن کامل

A three-phase matheuristic for capacitated multi-commodity fixed-cost network design with design-balance constraints

This paper proposes a three-phase matheuristic solution strategy for the capacitated multi-commodity fixed-cost network design problem with design-balance constraints. The proposed matheuristic combines exact and neighbourhood-based methods. Tabu search and restricted path relinking meta-heuristics cooperate to generate as many feasible solutions as possible. The two meta-heuristics incorporate...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2006